int countConsistentStrings(char *allowed, char **words, int wordsSize)
{
    int list[26] = {0};
    int re = 0;
    int temp = 0; // 判断words每个字符是不是合法的
    for (int i = 0; i < strlen(allowed); i++)
    {
        list[allowed[i] - 'a']++;
    }
    for (int i = 0; i < wordsSize; i++)
    {
        for (int j = 0; j < strlen(words[i]); j++)
        {
            if (list[words[i][j] - 'a'] == 0)
            {
                temp = 1;
                break;
            }
        }
        if (temp != 1)
        {
            re++;
        }
        else
        {
            temp = 0;
        }
    }
    return re;
}